A Globally Convergent MCA Algorithm by Generalized Eigen-Decomposition
نویسندگان
چکیده
منابع مشابه
A Globally Convergent Parallel Algorithm for Zeros of Polynomial Systems
POLYNOMIAL systems of equations frequently arise in solid modelling, robotics, computer vision, chemistry, chemical engineering, and mechanical engineering. Locally convergent iterative methods such as quasi-Newton methods may diverge or fail to find all meaningful solutions of a polynomial system. This paper proposes a parallel homotopy algorithm for polynomial systems of equations that is gua...
متن کاملA globally convergent QP-free algorithm for nonlinear semidefinite programming
In this paper, we present a QP-free algorithm for nonlinear semidefinite programming. At each iteration, the search direction is yielded by solving two systems of linear equations with the same coefficient matrix; [Formula: see text] penalty function is used as merit function for line search, the step size is determined by Armijo type inexact line search. The global convergence of the proposed ...
متن کاملSelf-Organizing and Adaptive Algorithms for Generalized Eigen-Decomposition
The paper is developed in two parts where we discuss a new approach to self-organization in a single-layer linear feed-forward network. First, two novel algorithms for self-organization are derived from a two-layer linear hetero-associative network performing a one-of-m classification, and trained with the constrained least-mean-squared classification error criterion. Second, two adaptive algor...
متن کاملA New QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm For Inequality Constrained Optimization
TO PRINT THE ENTIRE PAPER: Depending on the viewer you use, you may or may not be able to see more than this cover page. However, if you save the ps file or print it out you will obtain the entire paper: this cover page followed by 51 more pages. Erratum: In equation (5.3) (statement of Proposition 5.1) as well as in the last displayed equation in the proof of Proposition 5.1 (expression for λ ...
متن کاملGlobally convergent evolution strategies
In this paper we show how to modify a large class of evolution strategies (ES’s) for unconstrained optimization to rigorously achieve a form of global convergence, meaning convergence to stationary points independently of the starting point. The type of ES under consideration recombines the parent points by means of a weighted sum, around which the offspring points are computed by random genera...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computational Intelligence Systems
سال: 2011
ISSN: 1875-6891,1875-6883
DOI: 10.1080/18756891.2011.9727847